Smart edutainment game for algorithmic thinking

Algorithmic game theory

NETS 412 : Algorithmic Game

Recall that we argued last lecture that in any game, if every player plays according to the polynomial weights algorithm, then their empirical play history will converge to a coarse correlated equilibrium very quickly. In this lecture, we will give a new learning algorithm such that if every player plays according to it (in any game!) their empirical play history will converge to a correlated e...

Algorithmic Nominal Game Semantics

We employ automata over infinite alphabets to capture the semantics of a finitary fragment of ML with ground-type references. Our approach is founded on game semantics, which allows us to translate programs into automata in such a way that contextual equivalence is characterized by a finitary notion of bisimilarity. As a corollary, we derive a decidability result for a class of first-order prog...

Algorithmic Game Theory

I dedicate this thesis to my parents, Anjani and Sitanshu Mehta. iii ACKNOWLEDGEMENTS I would like to thank Dick Lipton and Vijay Vazirani, for their continuous support and guidance throughout these five years. Thanks also to the rest of the theory and ACO group at Georgia Tech, faculty and students, who have created such a motivating and enriching research environment. Thanks, of course, to my...

Algorithmic Game Theory

ing interaction among rational and self-interested agents. The field took on its modern form in the 1940s and 1950s (von Neumann and Morgenstern 1947; Nash 1950, Kuhn 1953), with even earlier antecedents (such as Zermelo 1913 and von Neumann 1928). Although it has had occasional and significant overlap with computer science over the years, game theory received most of its early study by economi...